Solution of sparse linear least squares problems using givens rotations
نویسندگان
چکیده
منابع مشابه
Parallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملLeast squares solution of nearly square overdetermined sparse linear systems
The solution of nearly square overdetermined linear systems is studied. The sparse QR technique is compared with two sparse LU-based techniques. Numerical tests with realworld and artificial matrices indicate that the LU techniques are more accurate for incompatible right-hand sides. Also, the amount of floating point operations required by LU techniques is approximately one half smaller than Q...
متن کاملLinear Least Squares Problems
A fundamental task in scientific computing is to estimate parameters in a mathematical model from collected data which are subject to errors. The influence of the errors can be reduced by using a greater number of data than the number of unknowns. If the model is linear, the resulting problem is then to “solve” an in general inconsistent linear system Ax = b, where A ∈ Rm×n and m ≥ n. In other ...
متن کاملA Direct Decomposition Method for the Solution of Sparse Linear Least Squares Problems
SUMMARY Given a sparse nonsquare system of linear equations Mx = b where M T M is either dense or full, we present a direct method that generates a least squares solution of the original system Mx = b by solving a smaller least squares problem. The method accomplishes this decomposition by applying orthogonal transformations to a restructured form of the original system of equations. The algori...
متن کاملA Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
Recently we have presented several schemes for computing spasse orthogonal factorizations using static data structures. The novel feature of each scheme is that the data structures are large enough to store both the orthogonal transformations and upper triangular factor explicitly. Thus, riiultiple least squares problems with the same observation matrix can be solved easily. However, in order t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1980
ISSN: 0024-3795
DOI: 10.1016/0024-3795(80)90159-7